Performances estimation for tensor CP decomposition with structured factors
نویسندگان
چکیده
The Canonical Polyadic tensor decomposition (CPD), also known as Candecomp/Parafac, is very useful in numerous scientific disciplines. Structured CPDs, i.e. with Toeplitz, circulant, or Hankel factor matrices, are often encountered in signal processing applications. As subsequently pointed out, specialized algorithms were recently proposed for estimating the deterministic parameters of structured CP decompositions. A closed-form expression of the Cramér-Rao bound (CRB) is derived, related to the problem of estimating CPD parameters, when the observed tensor is corrupted with an additive circular i.i.d. Gaussian noise. This CRB is provided for arbitrary tensor rank and sizes. Finally, the proposed CRB expression is used to asses the statistical efficiency of the existing algorithms by means of simulation results in the cases of third-order tensors having three circulant factors on one hand, and an Hankel factor on the other hand.
منابع مشابه
Spectral Compressed Sensing via CANDECOMP/PARAFAC Decomposition of Incomplete Tensors
We consider the line spectral estimation problem which aims to recover a mixture of complex sinusoids from a small number of randomly observed time domain samples. Compressed sensing methods formulates line spectral estimation as a sparse signal recovery problem by discretizing the continuous frequency parameter space into a finite set of grid points. Discretization, however, inevitably incurs ...
متن کاملTensor Decompositions with Banded Matrix Factors
The computation of themodel parameters of a Canonical Polyadic Decomposition (CPD), also known as the parallel factor (PARAFAC) or canonical decomposition (CANDECOMP) or CP decomposition, is typically done by resorting to iterative algorithms, e.g. either iterative alternating least squares type or descent methods. In many practical problems involving tensor decompositions such as signal proces...
متن کاملTensor subspace Tracking via Kronecker structured projections (TeTraKron) for time-varying multidimensional harmonic retrieval
We present a framework for Tensor-based subspace Tracking via Kronecker-structured projections (TeTraKron). TeTraKron allows to extend arbitrary matrix-based subspace tracking schemes to track the tensor-based subspace estimate. The latter can be computed via a structured projection applied to the matrix-based subspace estimate which enforces the multi-dimensional structure in a computationally...
متن کاملGuaranteed Tensor Decomposition: A Moment Approach
We develop a theoretical and computational framework to perform guaranteed tensor decomposition, which also has the potential to accomplish other tensor tasks such as tensor completion and denoising. We formulate tensor decomposition as a problem of measure estimation from moments. By constructing a dual polynomial, we demonstrate that measure optimization returns the correct CP decomposition u...
متن کاملTensor vs. Matrix Methods: Robust Tensor Decomposition under Block Sparse Perturbations
Robust tensor CP decomposition involves decomposing a tensor into low rank and sparse components. We propose a novel non-convex iterative algorithm with guaranteed recovery. It alternates between lowrank CP decomposition through gradient ascent (a variant of the tensor power method), and hard thresholding of the residual. We prove convergence to the globally optimal solution under natural incoh...
متن کامل